Linear cover time for trees is exponentially unlikely
نویسنده
چکیده
The cover time of a graph is the time it takes for a random walk on it to visit all vertices. This note shows that for any tree on n vertices, the probability that the cover time of the tree is linear in n is exponentially small in n. This is true for any starting vertex.
منابع مشابه
Linear Cover Time Is Exponentially Unlikely
We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. More precisely, for every D and C , there exists α=α(D,C ) > 0 such that for any graph G , with n vertices and maximal degree D , the probability that a simple random walk, started anywhere in G , will visit every vertex of G in its first C n steps is at most e−αn ...
متن کاملLinear Time Algorithms for Generalized Edge Dominating Set Problems
We prove that a generalization of the edge dominating set problem, in which each edge e needs to be covered be times for all e ∈ E, admits a linear time 2-approximation for general unweighted graphs and that it can be solved optimally for weighted trees. We show how to solve it optimally in linear time for unweighted trees and for weighted trees in which be ∈ {0, 1} for all e ∈ E. Moreover, we ...
متن کاملInvestigation on the Amount of Mortality of Iranian Oak Trees (Quercus brantii Lindi) using Satellite Imagery (Case study: Dashtebarm forests of Fars Province)
In recent years, oak trees in the Zagros forests have suffered a lot of fatalities for unclear reasons. Determining the rate and severity of forest crown density changes is important for the investigation and management of these forests. This research was carried out with the aim of determining the amount of crown cover changes in the forest area of Dashtebarm in Fars province under the influen...
متن کاملTransforming Hierarchical Trees on Metric Spaces
We show how a simple hierarchical tree called a cover tree can be turned into an asymptotically more efficient one known as a net-tree in linear time. We also introduce two linear-time operations to manipulate cover trees called coarsening and refining. These operations make a trade-off between tree height and the node degree.
متن کاملMHD rotating heat and mass transfer free convective flow past an exponentially accelerated isothermal plate with fluctuating mass diffusion
In this paper, we have considered the problem of rotating, magnetohydrodynamic heat and mass transfer by free convective flow past an exponentially accelerated isothermal vertical plate in the presence of variable mass diffusion. While the temperature of the plate is constant, the concentration at the plate is considered to be a linear function with respect to time t. The plate is assumed to be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Chicago J. Theor. Comput. Sci.
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012